A Polynomial Diophantine Generator Function for Integer Residuals
نویسنده
چکیده
Two Diophantine equation generator function for integer residuals produced by integer division over closed intervals are presented. One each for the closed intervals 1, √ and √ , , respectively.
منابع مشابه
Polynomial Parametrization of the Solutions of Diophantine Equations of Genus 0 Sophie Frisch and Günter Lettl
Abstract. Let f ∈ Z[X,Y, Z] be a non-constant, absolutely irreducible, homogeneous polynomial with integer coefficients, such that the projective curve given by f = 0 has a function field isomorphic to the rational function field Q(T ). We show that all integral solutions of the Diophantine equation f = 0 (up to those corresponding to some singular points) can be parametrized by a single triple...
متن کاملGlobal optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کاملSquares in Lucas Sequences with Rational Roots
In 1997, Darmon and Merel proved the stunning result that the Diophantine equation x + y = z has no nontrivial integer solutions for n ≥ 4. This can be interpreted as saying that if {vn} represents a Lucas sequence of the second kind, defined by a quadratic polynomial with rational roots, then the equation vn = x , with x an integer, implies that n ≤ 3. The goal of the present paper is to prove...
متن کاملDiophantine Sets of Polynomials over Number Fields
Let R be a number field or a recursive subring of a number field and consider the polynomial ring R[T ]. We show that the set of polynomials with integer coefficients is diophantine over R[T ]. Applying a result by Denef, this implies that every recursively enumerable subset of R[T ]k is diophantine over R[T ].
متن کاملSome Diophantine Triples and Quadruples for Quadratic Polynomials
In this paper, we give some new examples of polynomial D(n)triples and quadruples, i.e. sets of polynomials with integer coefficients, such that the product of any two of them plus a polynomial n ∈ Z[X] is a square of a polynomial with integer coefficients. The examples illustrate various theoretical properties and constructions for a quadratic polynomial n which appeared in recent papers. One ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1001.2752 شماره
صفحات -
تاریخ انتشار 2010